Uncountable Realtime Probabilistic Classes
نویسندگان
چکیده
We investigate the minimum cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On binary case, we follow the same result for double logarithmic space, which is tight. When replacing the worktape with some limited memories, we can follow uncountable results on unary languages for two counters.
منابع مشابه
Uncountable classical and quantum complexity classes
Polynomial–time constant–space quantum Turing machines (QTMs) and logarithmic–space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (Say and Yakaryılmaz 2014, arXiv:1411.7647). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough...
متن کاملUncountable Linear Orders
Two important classes of linear orders that are not σ-scattered are the real types and the Aronszajn types: the real types are those uncountable dense linear orders that are separable; the Aronszajn types are those linear orders that are uncountable and yet have no uncountable suborders that are scattered or real types. This latter class was considered—and proved nonempty—long ago by Aronszajn ...
متن کاملSome Uncountable Hierarchies of Formal Languages
We consider several types of similarity relationships between languages, and for an arbitrary language class we define appropriate similarity classes. We show that for any of the classes of regular, linear, contextfree, context-sensitive, recursive and recursively enumerable languages the appropriate similarity classes form an uncountable hierarchy of order type ω + λ + 2. We also show that the...
متن کاملProbabilistic Bisimulation: Naturally on Distributions
In contrast to the usual understanding of probabilistic systems as stochastic pro-cesses, recently these systems have also been regarded as transformers of probabili-ties. In this paper, we give a natural definition of strong bisimulation for probabilisticsystems corresponding to this view that treats probability distributions as first-classcitizens. Our definition applies i...
متن کاملAn uncountable family of three-generated groups
3 Universal group of the family 5 3.1 The construction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.2 Overgroup G̃ and conjugacy classes of Gw . . . . . . . . . . . . . . . . . . . . . . . 5 3.3 Contraction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 Isomorphism classes . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کامل